Rewriting modulo isotopies in pivotal linear (2,2)-categories
نویسندگان
چکیده
In this paper, we study linear rewriting systems modulo a set of algebraic axioms. We introduce the structure (3,2)-polygraph as presentation category enriched in categories, (called (2,2)-category), by system symbolic computation method order to compute bases for vector spaces 2-cells these categories. particular, case pivotal 2-categories using isotopy relations given biadjunctions on 1-cells and cyclicity conditions axioms modulo. By constructive method, recover normally ordered dotted oriented Brauer diagrams affine (2,2)-category.
منابع مشابه
Rewriting Modulo in Deduction Modulo
We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In a previous work, we defined general syntactic conditions based on the notion of computable closure for ensuring the termination of the combination of rewriting and beta-re...
متن کاملRewriting Modulo SMT
Combining symbolic techniques such as: (i) SMT solving, (ii) rewriting modulo theories, and (iii) model checking can enable the analysis of infinite-state systems outside the scope of each such technique. This paper proposes rewriting modulo SMT as a new technique combining the powers of (i)-(iii) and ideally suited to model and analyze infinite-state open systems; that is, systems that interac...
متن کاملRewriting Modulo \beta in the \lambda\Pi-Calculus Modulo
The λ Π-calculus Modulo is a variant of the λ -calculus with dependent types where β -conversion is extended with user-defined rewrite rules. It is an expressive logical framework and has been used to encode logics and type systems in a shallow way. Basic properties such as subject reduction or uniqueness of types do not hold in general in the λ Π-calculus Modulo. However, they hold if the rewr...
متن کاملRewriting modulo a rewrite system
We introduce rewriting with two sets of rules, the rst interpreted equa-tionally and the second not. A semantic view considers equational rules as deening an equational theory and reduction rules as deening a rewrite relation modulo this theory. An operational view considers both sets of rules as similar. We introduce suucient properties for these two views to be equivalent (up to diierent noti...
متن کاملRewriting in Free Hypegraph Categories
We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius structures recently appeared in cross-disciplinary applications, including the study of quantum processes, dynamical systems and natural language processing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2022
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2022.02.006